Verifying the CPS Transformation in Isabelle/HOL

Proving the Correctness of Disk Paxos in Isabelle/HOL

Disk Paxos [GL00] is an algorithm for building arbitrary faulttolerant distributed systems. The specification of Disk Paxos has been proved correct informally and tested using the TLC model checker, but up to now, it has never been fully formally verified. In this work we have formally verified its correctness using the Isabelle theorem prover and the HOL logic system [NPW02], showing that Isab...

Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL

Verifying Test-Hypotheses: An Experiment in Test and Proof

HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the original formula, called test specification, is partitioned into test cases by transformation into a normal form called test theorem. Second, the test cases are analyzed for ground instances (the test data) satisfying the con...

Verifying Probabilistic Correctness in Isabelle with pGCL

This paper presents a formalisation of pGCL in Isabelle/HOL. Using a shallow embedding, we demonstrate close integration with existing automation support. We demonstrate the facility with which the model can be extended to incorporate existing results, including those of the L4.verified project. We motivate the applicability of the formalism to the mechanical verification of probabilistic secur...

An Introduction to Certifying Algorithms Zertifizierende Algorithmen: Eine Einführung

version of the witness predicate is translated to Isabelle/HOL and Theorem 1 is proved there. gives us enough expressiveness to quantify over graphs, labellings, etc. and simplifies the translation to other proof systems. For verifying the mathematical part, we resort to Isabelle/HOL, a higher-order-logic interactive theorem prover [17]. We do so, since it has a large set of already formalized ...